منابع مشابه
A Third Drop Level For TCP-RED Congestion Control Strategy
This work presents the Risk Threshold RED (RTRED) congestion control strategy for TCP networks. In addition to the maximum and minimum thresholds in existing RED-based strategies, we add a third dropping level. This new dropping level is the risk threshold which works with the actual and average queue sizes to detect the immediate congestion in gateways. Congestion reaction by RTRED is on time....
متن کاملModelling TCP congestion control dynamics in drop-tail environments
In this paper we study communication networks that employ drop-tail queueing and additive-increase multiplicative-decrease (AIMD) congestion control algorithms. We show that the theory of non-negative matrices may be employed to model such networks and to derive basic theorems concerning their behaviour. 2007 Published by Elsevier Ltd.
متن کاملABSTRACT Title of Dissertation: DYNAMICS of TCP CONGESTION AVOIDANCE with RANDOM DROP and RANDOM MARKING QUEUES
Title of Dissertation: DYNAMICS of TCP CONGESTION AVOIDANCE with RANDOM DROP and RANDOM MARKING QUEUES Archan Misra, Doctor of Philosophy, 2000 Directed by: Professor John S. Baras, Department of Electrical and Computer Engineering Development and deployment of newer congestion feedback measures such as RED and ECN provides us a signi cant opportunity for modifying TCP response to congestion. E...
متن کاملPacket Loss of Congestion Control Using Early Random in Network
Congestion control of a variable bit-rate data stream crossing the Internet is crucial to ensuring the quality of the received data. This paper discusses the use of link-sharing mechanisms in packet networks and presents algorithms for hierarchical link-sharing. Hierarchical linksharing allows multiple agencies, protocol families, or traffic types to share the bandwidth on a link in a controlle...
متن کاملDynamic Routing and Congestion Control Through Random Assignment of Routes
We introduce an algorithm for maximizing utility through congestion control and random allocation of routes to users. The allocation is defined by a probability distribution whose degree of randomness as measured by its entropy, is controlled. We seek to use the entropy to modulate between the two extremes of path specification; minimum cost path selection on one end and equiprobable path alloc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGCOMM Computer Communication Review
سال: 1990
ISSN: 0146-4833
DOI: 10.1145/99517.99521